Towards Erdős-Hajnal for graphs with no 5-hole

The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), ω(G)) ≥ n for every H-free graph G with n vertices, and this is still open when H = C5. Until now the best bound known on max(α(G), ω(G)) for C5-free graphs was the general bound of Erdős and Hajnal, that for all H, max(α(G), ω(G)) ≥ 2 √ logn) if G is H-free. We improve this when H = C5 to max(α(G), ω(G)) ≥ 2 √ logn log .